Efficient Hierarchical Identity Based Signature in the Standard Model

In this paper, we propose a new efficient hierarchical identity based signature (HIBS) scheme. Our scheme can be proven probably secure based on a natural hardness assumption (i.e. h-exponent computational diffie-hellman problem (h-CDH)) in the standard model. Our scheme only requires three pairing computations in verification, which has no relations with the hierarchy. Our scheme has constant signature size, and the length of a user's private key is shrinking as the depth increases. Most importantly, our scheme is non-public-verifiable. Only the specified recipient can verify the signature, which is very important for some private communications.